01. Welcome!
Welcome!
A01 C1 Intro
In this lesson, we'll go over some of the basic components of the C++ language. Throughout this lesson and the next, you will be writing C++ code to perform A* search to find the shortest path between two points on an ASCII grid with obstacles. When you are done, you will be able to print the path just as in the image below. Let's get started!
🚦 ⛰️ 0 0 0 0
🚗 ⛰️ 0 0 0 0
🚗 ⛰️ 0 0 0 0
🚗 ⛰️ 0 🚗 🚗 🚗
🚗 🚗 🚗 🚗 ⛰️ 🏁